package com.ganwenlong.collections;

import java.util.Collections;
import java.util.Iterator;
import java.util.SortedSet;
import java.util.TreeSet;

public class SortedSetDemo {

	public static void main(String[] args) {
		SortedSet<String> sortedSet = new TreeSet<String>(); 
		Collections.addAll(sortedSet, "one two three four five six seven eight".split(" ")); 
		System.out.println(sortedSet); 
		String low = sortedSet.first(); 
		String high = sortedSet.last(); 
		System.out.println(low); 
		System.out.println(high); 
		Iterator<String> iterator = sortedSet.iterator(); 
		for(int i=0; i<=7; i++) { 
			if(i == 3) { 
				low = iterator.next(); 
			} else if(i == 7) { 
				high = iterator.next(); 
			} else { 
				iterator.next(); 
			}
		}
		System.out.println(low); 
		System.out.println(high); 
		System.out.println(sortedSet.subSet(low, high)); 
		System.out.println(sortedSet.headSet(high)); 
		System.out.println(sortedSet.tailSet(low)); 

	}
	
}
